Avoiding 3/2-powers over the natural numbers
نویسندگان
چکیده
In this paper we answer the following question: what is the lexicographically least sequence over the natural numbers that avoids 32 -powers?
منابع مشابه
Crucial Words for Abelian Powers
In 1961, Erdős asked whether or not there exist words of arbitrary length over a fixed finite alphabet that avoid patterns of the form XX ′ where X ′ is a permutation of X (called abelian squares). This problem has since been solved in the affirmative in a series of papers from 1968 to 1992. Much less is known in the case of abelian k-th powers, i.e., words of the form X1X2 . . . Xk where Xi is...
متن کاملRestricted Dumont permutations
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schröder numbers, and other known or related sequences.
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملOn the discrete logarithm problem in elliptic curves
We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the elliptic curve discrete logarithm problem restricted to curves over the fields Fqi i can be solved in subexponential expected time (qi i ) . We also show that there exists a sequen...
متن کاملSymmetric Permutations Avoiding Two Patterns ∗
Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012